| Definitions | left + right, P  Q, e  loc e' , E, type List, [], t  T, A List , s = t, x:A  B(x),  x:A. B(x), [car / cdr], {x:A| B(x)} , before(e), as @ bs,  , P   Q, (e <loc e'), ES, WellFnd{i}(A;x,y.R(x;y)), x:A  B(x), a:A fp B(a), [e, e'], <a, b>, strong-subtype(A;B),  x.A(x), {T},  x. t(x), es-le-before(es;e),  b, f(a), x(s), let x,y = A in B(x;y), t.1, e < e', loc(e), Id, P & Q, (e < e'),  ,  A, P  Q, False, P Q, e c e', es-init(es;e), True, Void, pred(e), Type, EqDecider(T), Unit, IdLnk, EOrderAxioms(E; pred?; info), EState(T), Knd, x,y. t(x;y), kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M),  ,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r s, constant_function(f;A;B), Top, loc(e), kind(e), A c B,  T, s ~ t, SQType(T), A B, i  j , ||as||, first(e), ff,  b, tt, x dom(f), case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , p =b q, i <z j, i z j, (i = j), x =a y, null(as), a < b, x f y, a < b, [d], eq_atom$n(x;y), q_le(r;s), q_less(a;b), qeq(r;s), a = b, a = b, deq-member(eq;x;L), e = e', p q, p q, p q,  |